Monotonicity of permanents of certain doubly stochastic circulant matrices
نویسندگان
چکیده
منابع مشابه
MONOTONICTTY CONJECTURE ON PERMANENTS OF DOUBLY STOCHASTIC MATRICES i
A stronger version of the van der Waerden permanent conjecture asserts that if J„ denotes the n X n matrix all of whose entries are \/n and A is any fixed matrix on the boundary of the set ofnxn doubly stochastic matrices, then per(A/4 + (1 — \)Jn) as a function of X is nondecreasing in the interval [0, 1]. In this paper, we elucidate the relation of this assertion to some other conjectures kno...
متن کاملMinimum permanents on two faces of the polytope of doubly stochastic matrices∗
We consider the minimum permanents and minimising matrices on the faces of the polytope of doubly stochastic matrices whose nonzero entries coincide with those of, respectively, Um,n = [ In Jn,m Jm,n 0m ] and Vm,n = [ In Jn,m Jm,n Jm,m ] . We conjecture that Vm,n is cohesive but not barycentric for 1 < n < m + √ m and that it is not cohesive for n > m + √ m. We prove that it is cohesive for 1 <...
متن کاملOn the Permanent of Certain Circulant Matrices
In this paper we rst review the basic computational properties of per-manents, and then address some problems concerning permanents of (0; 1) circulant matrices. In particular we analyze their role at the boundary between computational tractability and intractability, showing that (i) a generic circulant matrix contains large arbitrary submatrices, a fact which casts some doubt on the tractabil...
متن کاملDoubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملRandom doubly stochastic tridiagonal matrices
Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1981
ISSN: 0024-3795
DOI: 10.1016/0024-3795(81)90182-8